Partial Model Checking
نویسنده
چکیده
A major obstacle in applying nite-state model checking to the veriication of large systems is the com-binatorial explosion of the state space arising when many loosely coupled parallel processes are considered. The problem also known as the state-explosion problem has been attacked from various sides. This paper presents a new approach based on partial model checking: Parts of the concurrent system are gradually removed while transforming the speciication accordingly. When the intermediate speciications constructed in this manner can be kept small, the state-explosion problem is avoided. Experimental results with a prototype implemented in Standard ML, shows that for Milner's Scheduler | an often used benchmark | this approach improves on the published results on Binary Decision Diagrams and is comparable to results obtained using generalized Decision Diagrams. Speciications are expressed in a variant of the modal-calculus.
منابع مشابه
Combining Partial Order Reduction with Bounded Model Checking
Model checking is an efficient technique for verifying properties on reactive systems. Partial-order reduction (POR) and symbolic model checking are two common approaches to deal with the state space explosion problem in model checking. Traditionally, symbolic model checking uses BDDs which can suffer from space blowup. More recently bounded model checking (BMC) using SAT-based procedures has b...
متن کاملCombining Partial
Partial order based reduction techniques to reduce time and memory in model-checking procedures are becoming quite popular. Partial order reduction techniques exploit the independence of actions. Symmetry based reduction techniques exploit the inherent structure of the system to reduce the state space explored during model checking. We provide an abstract framework for combining partial-order a...
متن کاملAn improvement in partial-order model-checking with ample sets
In [18], Peled describes a partial-order reduction method to alleviate the state-explosion problem for LTL model-checking, i.e. for verifying that concurrent programs satisfy their linear temporal logic specifications. We present an approach that improves the method in [18] by enabling a further reduction of the space and time required for LTL model-checking.
متن کاملPartial - Order Reduction in theWeak Modal Mu -
We present a partial-order reduction technique for local model checking of hierarchical networks of labeled transition systems in the weak modal mu-calculus. We have implemented our technique in the Concur-rency Factory speciication and veriication environment; experimental results show that partial-order reduction can be highly eeective in combating state explosion in modal mu-calculus model c...
متن کاملOn Partial-Order Reduction and Trail Improvement in Directed Model Checking
In this paper we address the problem of reconciling trail improvement, partial order reduction and directed explicit state model checking. While directed model checking addresses the problem of finding optimally short counterexamples, trail improvement seeks to find shorter trails to some given error state. Both directed model checking and trail improvement employ heuristic, guided search techn...
متن کامل